home *** CD-ROM | disk | FTP | other *** search
- Path: news.microsoft.com!news
- From: a-cnadc@microsoft.com (Dann Corbit)
- Newsgroups: comp.lang.c
- Subject: Re: Fastest way to computer log(base2) of x?
- Date: 1 Feb 1996 18:12:49 GMT
- Organization: Microsoft Corporation
- Message-ID: <4eqvr1$7tn@news.microsoft.com>
- References: <4e61iu$p6e@villa.fc.net> <4e6p7t$1n72@cymbal.aix.calpoly.edu> <4e8r54$n8q@ns.RezoNet.NET>,<4e9bl4$3ccp@cymbal.aix.calpoly.edu> <DM0AKu.A2H@news.cern.ch>
- NNTP-Posting-Host: 157.57.171.202
- Mime-Version: 1.0
- X-Newsreader: WinVN 0.93.14
-
- Just a note that none of theses methods really find the base 2
- log of a number unless the number is a power of 2. It is only
- a crude approximation of the log most of the time. You are
- finding the highest bit, that is all. NOT the log base 2.
- --
- The opinions expressed in this message are my own personal views
- and do not reflect the official views of Microsoft Corporation.
-
-